Octonion Discrete Fourier Transform : Fast Algorithms
نویسندگان
چکیده
The color image from one of the color models, for instance the RGB model, can be transformed into the quaternion algebra and be represented as one quaternion image which allows to process simultaneously of all color components of the image. The color image can be also considered in different models with transformation to the octonion space with following processing in the 8-D frequency domain. In this work, we describe the algorithm for the 2-D two-side octonion DFT (ODFT), by using two-side 2-D quaternion DFTs (QDFT). The calculation of the transform is reduced to calculation of two 2-D QDFT which has fast algorithms. The octonion algebra with the Fourier transform can be used in color imaging as the 2-D ODFT, which found effective applications in color imaging, medical imaging, in image filtration, image enhancement. The octonion 2-D DFT can be used not only in color imaging, but in gray-scale imaging as well, and for that there are many models of transferring one or a few gray-scale images into the octonion space.
منابع مشابه
A Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملFast Fourier Transform Processors: Implementing FFT and IFFT Cores for OFDM Communication Systems
The terms Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) are used to denote efficient and fast algorithms to compute the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT) respectively. The FFT/IFFT is widely used in many digital signal processing applications and the efficient implementation of the FFT/IFFT is a topic of continuous research.
متن کاملReal-valued fast Fourier transform algorithms
This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform (DFT) of a real-valued series. The application of these ideas to all the major fast Fourier transform (FFT) algorithms is discussed, and the various algorithms are compared. We present a new implementation of the real-valued split-radix FFT, an algorithm that uses few...
متن کاملRapid Computation of the Discrete Fourier Transform
Algorithms for the rapid computation of the forward and inverse discrete Fourier transform for points which are nonequispaced or whose number is unrestricted are presented. The computational procedure is based on approximation using a local Taylor series expansion and the fast Fourier transform (FFT). The forward transform for nonequispaced points is computed as the solution of a linear system ...
متن کاملUsing a Fast Fourier Transform Algorithm
The symmetry and periodicity properties of the discrete Fourier transform (DFT) allow a variety of useful and interesting decompositions. In particular, by clever grouping and reordering of the complex exponential multiplications it is possible to achieve substantial computational savings while still obtaining the exact DFT solution (no approximation required). Many “fast” algorithms have been ...
متن کامل